A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation
نویسندگان
چکیده
منابع مشابه
Barycentric Lagrange Interpolation
Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable. It deserves to be known as the standard method of polynomial interpolation.
متن کاملThe numerical stability of barycentric Lagrange interpolation
The Lagrange representation of the interpolating polynomial can be rewritten in two more computationally attractive forms: a modified Lagrange form and a barycentric form. We give an error analysis of the evaluation of the interpolating polynomial using these two forms. The modified Lagrange formula is shown to be backward stable. The barycentric formula has a less favourable error analysis, bu...
متن کاملASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
We present a fast algorithm for kernel summation problems in high-dimensions. These problems appear in computational physics, numerical approximation, non-parametric statistics, and machine learning. In our context, the sums depend on a kernel function that is a pair potential defined on a dataset of points in a high-dimensional Euclidean space. A direct evaluation of the sum scales quadratical...
متن کاملOn Multivariate Lagrange Interpolation
Lagrange interpolation by polynomials in several variables is studied through a finite difference approach. We establish an interpolation formula analogous to that of Newton and a remainder formula, both of them in terms of finite differences. We prove that the finite difference admits an integral representation involving simplex spline functions. In particular, this provides a remainder formul...
متن کاملOn Boundedness of Lagrange Interpolation
We estimate the distribution function of a Lagrange interpolation polynomial and deduce mean boundedness in Lp; p < 1: 1 The Result There is a vast literature on mean convergence of Lagrange interpolation, see [4{ 8] for recent references. In this note, we use distribution functions to investigate mean convergence. We believe the simplicity of the approach merits attention. Recall that if g : R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Computational Physics
سال: 2020
ISSN: 1815-2406,1991-7120
DOI: 10.4208/cicp.oa-2019-0177